Modal Logic of Transition Systems in the Topos of Trees

نویسندگان

  • Colin Riba
  • Guilhem Jaber
چکیده

We investigate the adjunction between the category of tran-sition systems (with not nec. bounded morphisms) and the topos of treesS from the perspective of the basic modal logic K on transition systems.More specifically, we show how the modal logic K over an object of Sseen as a transition system can be lifted back as a subobject of S . Thisrelies on the usual mutually transpose formulations of modal satisfactionas either a map of transition system or as a map of Boolean algebras withoperators. Moreover, thanks to the usual geometric morphism from theBoolean toposPsh(|N∗|) of presheaves over the discrete category of nat-ural numbers to S , we can give a characterization of modal satisfactionwithin S as a map from formulae to total subobjects of S whose imagein the Boolean toposPsh(|N∗|) is an internal map of Boolean algebras.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Sequent Calculus in the Topos of Trees

Nakano’s “later” modality, inspired by Gödel-Löb provability logic, has been applied in type systems and program logics to capture guarded recursion. Birkedal et al modelled this modality via the internal logic of the topos of trees. We show that the semantics of the propositional fragment of this logic can be given by linear converse-well-founded intuitionistic Kripke frames, so this logic is ...

متن کامل

Bisimulation from Open Maps

An abstract definition of bisimulation is presented. It enables a uniform definition of bisimulation across a range of different models for parallel computation presented as categories. As examples, transition systems, synchronisation trees, transition systems with independence (an abstraction from Petri nets) and labelled event structures are considered. On transition systems the abstract defi...

متن کامل

The Topos of Labelled Trees: A Categorical Semantics for SCCS

In this paper a we give a semantics for SCCS using the constructions of the topos of labelled trees. The semantics accounts for all aspects of the original formulation of SCCS, including unbounded non-determinism. Then, a partial solution to the problem of characterizing bisimulation in terms of a class of morphisms is proposed. We deene a class of morphisms of the topos of trees, called connic...

متن کامل

Suhrawardi's Modal Syllogisms

Suhrawardi’s logic of the Hikmat al-Ishraq is basically modal. So to understand his modal logic one first has to know the non-modal part upon which his modal logic is built. In my previous paper ‘Suhrawardi on Syllogisms’(3) I discussed the former in detail. The present paper is an exposition of his treatment of modal syllogisms. On the basis of some reasonable existential presuppositi...

متن کامل

First Steps in Synthetic Guarded Domain Theory

We present the topos S of trees as a model of guarded recursion. We study the internal dependently-typed higher-order logic of S and show that S models two modal operators, on predicates and types, which serve as guards in recursive definitions of terms, predicates, and types. In particular, we show how to solve recursive type equations involving dependent types. We propose that the internal lo...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2017